A Multigrid Method Based on Incomplete Gaussian Elimination
نویسندگان
چکیده
منابع مشابه
A Multigrid Method Based on Incomplete Gaussian Elimination
In this paper we introduce and analyze a new Schur complement approximation based on incomplete Gaussian elimination. The approximate Schur complement is used to develop a multigrid method. This multigrid method has an algorithmic structure that is very similar to the algorithmic structure of classical multigrid methods. The resulting method is almost purely algebraic and has interesting robust...
متن کاملA Supernodal Out-of-Core Sparse Gaussian-Elimination Method
We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with partial pivoting. It assumes that A fits within main memory, but it stores the L and U factors on disk (that is, in files). Experimental results indicate that on small to moderately-large matrices (whose factors fit or almost fit...
متن کاملA Numerical Solution of Burgers' Equation Based on Multigrid Method
in this article we discussed the numerical solution of Burgers’ equation using multigrid method. We used implicit method for time discritization and Crank-Nicolson scheme for space discritization for fully discrete scheme. For improvement we used Multigrid method in fully discrete solution. And also Multigrid method accelerates convergence of a basics iterative method by global correction. Nume...
متن کاملImprovements of Algebraic Attacks Based on Structured Gaussian Elimination
Algebraic attacks are studied as a potential cryptanalytic procedure for various types of ciphers. The XL SGE algorithm has been recently proposed to improve the complexity of the XL attack. XL SGE uses structured Gaussian elimination (SGE) during the expansion phase of XL. In this paper, we establish that XL SGE suffers from some serious drawbacks that impair the effectiveness of SGE-based red...
متن کاملGaussian elimination
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of the most important and ubiquitous numerical algorithms. However, its successful use relies on understanding its numerical stability properties and how to organize its computations for efficient execution on modern computers. We give an overview of GE, ranging from theory to computation. We explai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 1996
ISSN: 1070-5325,1099-1506
DOI: 10.1002/(sici)1099-1506(199609/10)3:5<369::aid-nla89>3.0.co;2-m